Iterative Re nement and Condensation for State graph Construction
نویسندگان
چکیده
The traditional technique to generate a global state graph representation for a concurrent system is to calculate the product of state graph representations of the local processes We develop new techniques and prove their correctness to help condensing intermediate state graphs in the iterative product calculation Experiments with Fischer s timed mutual exclusion protocol have been carried out to justify the approach
منابع مشابه
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2013, December 12-14, 2013, Guwahati, India
ion Re nement for Games with Incomplete Information Counterexample-guided abstraction re nement (CEGAR) is used in automated software analysis to nd suitable nite-state abstractions of in nite-state systems. In this paper, we extend CEGAR to games with incomplete information, as they commonly occur in controller synthesis and modular veri cation. The challenge is that, under incomplete informat...
متن کاملScheduling Constraint Based Abstraction Refinement for Multi-Threaded Program Verification
Bounded model checking is among the most ecient techniques for the automatic verication of concurrent programs. However, encoding all possible interleavings oen requires a huge and complex formula, which signicantly limits the salability. is paper proposes a novel and ecient abstraction renement method for multi-threaded program verication. Observing that the huge formula is usually dom...
متن کاملEnhancing Dependability via Parameterized Re nement
A probabilistic extension of the re nement calculus has been successfully applied in the design of safety-critical systems. The approach is based on a rm mathematical foundation within which the reasoning about correctness and behavior of the system under construction is carried out. The framework allows us also to obtain a quantitative assessment of the attributes of system dependability. In t...
متن کاملIterative Re nement and LAPACKN
The technique of iterative reenement for improving the computed solution to a linear system was used on desk calculators and computers in the 1940s and has remained popular. In the 1990s iterative reenement is well supported in software libraries, notably in LAPACK. Although the behaviour of iterative re-nement in oating point arithmetic is reasonably well understood, the existing theory is not...
متن کاملCounterexample - guided Abstraction Re nement
We present an automatic iterative abstraction-re nement methodology in which the initial abstract model is generated by an automatic analysis of the control structures in the program to be veri ed. Abstract models may admit erroneous (or \spurious") counterexamples. We devise new symbolic techniques which analyze such counterexamples and re ne the abstract model correspondingly. The re nement a...
متن کامل